Production sequencing in a flow shop system using optimization and heuristic algorithms
نویسندگان
چکیده
منابع مشابه
Optimizing Flow Shop Sequencing Through Simulation Optimization Using Evolutionary Methods
This paper describes an approach to use an adapted Evolution Strategies (ES) algorithm to generate improved sequences for producing unique parts in a flow shop. The algorithm uses principles from both genetic algorithms and Evolution Strategies. While several alternative algorithms were considered, the focus of this paper is on the one that performed the best for this problem domain. The best a...
متن کاملSome efficient heuristic methods for the flow shop sequencing problem
We compare in this paper the best heuristic methods known up to now to solve the flow shop sequencing problem and we improve the complexity of the best one. Next, we apply to this problem taboo search, a new technique to solve combinatorial optimization problems, and we report computational experiments. Finally a parallel taboo search algorithm is presented and experimental results show that th...
متن کاملFlow-shop sequencing using hybrid simulated annealing
Simulated annealing (SA) heuristics have been successfully applied on a variety of complex optimization problems. This paper presents a new hybrid SA approach for the permutation ¯ow-shop scheduling (FSS) problem. FSS is known to be NP-hard, and thus the right way to proceed is through the use of heuristics techniques. The proposed approach combines the characteristics of a canonical SA procedu...
متن کاملImproved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems
Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...
متن کاملFlow-shop Problems: A Heuristic Search Algorithm
This article presents an intelligent heuristic search algorithm (IHSA*) for solving flow-shop problems with two or three machines and an arbitrary number of jobs. Following its initial development the algorithm has been modified in two different ways in order to reduce backtracking and to improve its performance. The first modification concerns the choice of the best heuristic function to use, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Gestão & Produção
سال: 2021
ISSN: 1806-9649,0104-530X
DOI: 10.1590/1806-9649.2020v28e3886